Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts
نویسندگان
چکیده
A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, augmented by a coarse-grained local search algorithm that learns favorable value heuristics over the course of several restarts. Numerical results show that this method can speedup complete search by orders of magnitude.
منابع مشابه
Disco – Novo – GoGo Integrating
A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, augmented by a coarse-grained local search algorithm that learns favorable value heuristics over the course of several restarts. Numerical results show that this method can speedup complete search by orders of magnitude.
متن کاملDisco – Novo
A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, augmented by a coarse-grained local search algorithm that learns favorable value heuristics over the course of several restarts. Numerical results show that this method can speedup complete search by orders of magnitude.
متن کاملCh-sat: a Complete Heuristic Procedure for Satissability Problems
This paper presents CH-SAT, a Complete Heuris-tic procedure for the SATissability problem (SAT) based on local search techniques. CH-SAT aims to combine the ee-ciency of local search and the completeness of memorizing-backtracking. CH-SAT extends successively a consistent partial assignment using a complete assignment as guidance for variable-ordering. To extend the partial assignment, CH-SAT u...
متن کاملComplete Restart Strategies Using a Compact Representation of the Explored Search Space
Applying restarts to complete search algorithms for constraint satisfaction is an effective method for improving their expected performance on some difficult problems. An issue with restarts is that completeness can be lost if the algorithm is constantly interrupted in the midst of a search. We propose a general method for called path-recording, which guarantees completeness for restart strateg...
متن کاملA New Local-Search Algorithm for Forward-Chaining Planning
Forward-chaining heuristic search is a well-established and popular paradigm for domain-independent planning. Its effectiveness relies on the heuristic information provided by a state evaluator, and the search algorithm used with this in order to solve the problem. This paper presents a new stochastic local-search algorithm for forward-chaining planning. The algorithm is used as the basis of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006